Asymptotic behaviour of convex and column-convex lattice polygons with fixed area and varying perimeter
نویسندگان
چکیده
منابع مشابه
Asymptotic behaviour of convex and column-convex lattice polygons with fixed area and varying perimeter
We study the inflated phase of two dimensional lattice polygons, both convex and column-convex, with fixed area A and variable perimeter, when a weight μ exp[−Jb] is associated to a polygon with perimeter t and b bends. The mean perimeter is calculated as a function of the fugacity μ and the bending rigidity J . In the limit μ → 0, the mean perimeter has the asymptotic behaviour 〈t〉/4 √ A ≃ 1−K...
متن کاملConvex lattice polygons of fixed area with perimeter-dependent weights.
We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a ...
متن کاملBundling Three Convex Polygons to Minimize Area or Perimeter
Given a set P = {P0, . . . , Pk−1} of k convex polygons having n vertices in total in the plane, we consider the problem of finding k translations τ0, . . . , τk−1 of P0, . . . , Pk−1 such that the translated copies τiPi are pairwise disjoint and the area or the perimeter of the convex hull of ⋃k−1 i=0 τiPi is minimized. When k = 2, the problem can be solved in linear time but no previous work ...
متن کاملOn convex lattice polygons
Let II be a convex lattice polygon with b boundary points and c (5 1) interior points. We show that for any given a , the number b satisfies b 5 2e + 7 , and identify the polygons for which equality holds. A lattice polygon II is a simple polygon whose vertices are points of the integral lattice. We let A = 4(11) denote the area of II , b{U) the number of lattice points on the boundary of II , ...
متن کاملConvex Lattice Polygons
Let n ≥ 3 be an integer. A convex lattice n-gon is a polygon whose n vertices are points on the integer lattice Z 2 and whose interior angles are strictly less than π. Let a n denote the least possible area enclosed by a convex lattice n-gon, then [1, 2, 3] {a n } ∞ n=3 = n 1 2
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2010
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2010/07/p07029